On certain partition bijections related to Euler's partition problem
نویسندگان
چکیده
Abstract We give short elementary expositions of combinatorial proofs some variants Euler's partition identity that were first addressed analytically by George Andrews, and later combinatorially others. The method using certain matrices to concisely explain these bijections, based on ideas used in a previous manuscript the author, enables us also new generalizations two results.
منابع مشابه
Partition Bijections, a Survey
We present an extensive survey of bijective proofs of classical partitions identities. While most bijections are known, they are often presented in a different, sometimes unrecognizable way. Various extensions and generalizations are added in the form of exercises.
متن کاملPartition identity bijections related to sign-balance and rank
In this thesis, we present bijections proving partitions identities. In the first part, we generalize Dyson's definition of rank to partitions with successive Durfee squares. We then present two symmetries for this new rank which we prove using bijections generalizing conjugation and Dyson's map. Using these two symmetries we derive a version of Schur's identity for partitions with successive D...
متن کاملPartition Identities and Geometric Bijections
We present a geometric framework for a class of partition identities. We show that there exists a unique bijection proving these identities, which satisfies certain linearity conditions. In particular, we show that Corteel’s bijection enumerating partitions with nonnegative r-th differences can be obtained by our approach. Other examples and generalizations are presented.
متن کاملThe Nature of Partition Bijections I. Involutions
We analyze involutions which prove several partition identities and describe them in a uniform fashion as projections of “natural” partition involutions along certain bijections. The involutions include those due to Franklin, Sylvester, Andrews, as well as few others. A new involution is constructed for an identity of Ramanujan, and analyzed in the same fashion. Introduction Combinatorial metho...
متن کاملOn a cycle partition problem
Let G be any graph and let c(G) denote the circumference of G. We conjecture that for every pair c1, c2 of positive integers satisfying c1 + c2 = c(G), the vertex set of G admits a partition into two sets V1 and V2, such that Vi induces a graph of circumference at most ci , i = 1, 2. We establish various results in support of the conjecture; e.g. it is observed that planar graphs, claw-free gra...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2022
ISSN: ['1872-681X', '0012-365X']
DOI: https://doi.org/10.1016/j.disc.2021.112673